Balanced ranking mechanisms
نویسندگان
چکیده
منابع مشابه
Balanced Ranking Mechanisms
In the private values single object auction model, we construct a satisfactory mechanism a symmetric, dominant strategy incentive compatible, and budget-balanced mechanism. Our mechanism allocates the object to the highest valued agent with more than 99% probability provided there are at least 14 agents. It is also ex-post individually rational. We show that our mechanism is optimal in a restri...
متن کاملBalanced Bayesian mechanisms
We present a new condition on beliefs that guarantee the Bayesian implementability of all efficient social decision rules. We show that this condition is easy to verify and is both more interpretable and more general than the conditions that are found in the literature. We also study conditions guaranteeing the Bayesian implementability of all social decision rules with balanced budget mechanisms.
متن کاملIncentive Based Ranking Mechanisms
We consider ranking and recommendation systems based on user feedback. We make a case for sharing the revenue generated by such systems with users as incentive to provide useful feedback. Our main contribution are mechanisms for ranking/recommendation which gives incentive for the users to provide useful feedback and is resistant to selfish/malicious behavior (click spam). The mechanisms are de...
متن کاملRanking Mechanisms for Interaction Networks
Interaction networks are prevalent in real world applications and they manifest in several forms such as online social networks, collaboration networks, technological networks, and biological networks. In the analysis of interaction networks, an important aspect is to determine a set of key nodes either with respect to positional power in the network or with respect to behavioral influence. Thi...
متن کاملBalanced ranking method for constrained optimization problems using evolutionary algorithms
. This work presents a new technique to handle constraints in the solution of optimization problems by evolutionary algorithms – the Balanced Ranking Method (BRM). In this method the fitness function is based on two rankings, for feasible and infeasible solutions respectively. The rankings are merged according to deterministic criteria that consider the status of the search process and specific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2017
ISSN: 0899-8256
DOI: 10.1016/j.geb.2017.07.002